Implementation Of Quadratic Rotation Decomposition Based Recursive Least Squares Algorithm

نویسندگان

  • Manpreet Singh
  • Sandeep Singh Gill
چکیده

Quadratic Rotation decomposition (QRD) based recursive least squares (RLS) algorithm can be used in variety of communication applications and its low complexity implementation can be of interest. In this paper we have presented FPGA implementation of QRD based RLS algorithm using Coordinate Rotation by Digital Computer (CORDIC) operator. FPGA resource estimates along with actual implementation results illustrating the weight calculation delays have also been presented presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Area Optimized Fpga Implementation of Adaptive Beamformer

Quadratic Rotation decomposition (QRD) based recursive least squares (RLS) algorithm can be used in variety of communication applications and its low complexity implementation can be of interest. In this paper we have presented an application of QRD based RLS algorithm using Coordinate Rotation by Digital Computer (CORDIC) operator for implementing an adaptive beamformer. FPGA resource estimate...

متن کامل

Implementation of CORDIC-Based QRD-RLS Algorithm on Altera Stratix FPGA with Embedded Nios Soft Processor Technology

WP-STXQRD-01 This white paper describes the implementation of the QR decomposition-based recursive least squares (RLS) algorithm on Altera StratixTM FPGAs. Coordinate Rotation by Digital Computer (CORDIC) operators can be efficiently time-shared to perform the QR decomposition while consuming minimal resources. Back substitution can then be performed on the embedded soft Nios processor by utili...

متن کامل

Systolic block Householder transformation for RLS algorithm with two-level pipelined implementation

The QR decomposition, recursive least squares (QRD RLS) algorithm is one of the most promising RLS algorithms, due to its robust numerical stability and suitability for VLSI implementation based on a systolic array architecture. Up to now, among many techniques to implement the QR decomposition, only the Givens rotation and modified GramSchmidt methods have been successfully applied to the deve...

متن کامل

Recursive least-squares using a hybrid Householder algorithm on massively parallel SIMD systems

Within the context of recursive least-squares, the implementation of a Householder algorithm for block updating the QR decomposition, on massively parallel SIMD systems, is considered. Initially, two implementations based on di€erent mapping strategies for distributing the data matrices over the processing elements of the parallel computer are investigated. Timing models show that neither of th...

متن کامل

Iterative version of the QRD for adaptive RLS filtering

A modiied version of the QR{decomposition (QRD) is presented. It uses approximate Givens rotations instead of exact Givens rotations, i.e., a matrix entry usually annihilated with an exact rotation by an angle is only reduced by using an approximate rotation by an angle ~. The approximation of the rotations is based on the idea of CORDIC. Evaluating a CORDIC{based approximate rotation is to det...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011